Solving Capacitated Vehicle Routing Problem (CVRP) Using Tabu Search Algorithm (TSA)
نویسندگان
چکیده
منابع مشابه
APPLICATION of HYBRID ANT COLONY OPTIMIZATION (HACO) AlGORITHM for SOLVING CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)
The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...
متن کاملA Hybrid Ant Colony Optimization(HACO) for Solving Capacitated Vehicle Routing Problem(CVRP)
The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP is an important problem in the fields of transportation, distribution and logistics. Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملCuckoo Search Algorithm for Capacitated Vehicle Routing Problem
The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routi...
متن کاملA tabu search algorithm for the vehicle routing problem
The purpose of this study is to develop a new tabu seach heuristic to solve the single-depot vehicle routing problem of a distribution company carrying goods from a depot to a set of dedicated dealers. The heuristic proposes a new neighbourhood generation procedure which considers the scattering pattern in the locations of the dealers. A set of neighbours are generated by first executing a proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ibn AL- Haitham Journal For Pure and Applied Science
سال: 2018
ISSN: 2521-3407,1609-4042
DOI: 10.30526/31.2.1949